An n log n algorithm for determining the congruity of polyhedra
نویسندگان
چکیده
منابع مشابه
An O(log n/ log log n)-approximation Algorithm for the Asymmetric Traveling Salesman Problem
We consider the Asymmetric Traveling Salesman problem for costs satisfying the triangle inequality. We derive a randomized algorithm which delivers a solution within a factor O(log n/ log log n) of the optimum with high probability.
متن کاملAn N Log N Algorithm for Online Bdd Reenement ?
Binary Decision Diagrams are in widespread use in veriica-tion systems for the canonical representation of nite functions. Here we consider multi-valued BDDs, which represent functions of the form ' : B ! L, where L is a nite set of leaves. We study a rather natural online BDD reenement problem: a partition of the leaves of several shared BDDs is gradually reened, and the equivalence of the BDD...
متن کاملAn O ( n log n ) Algorithm for nding
Let be a nite alphabet and x 2 n. A string y 2 m is said to be k-dissimilar to x, if no k length substring of x is equal to any k length substring of y. We present an O(n log n) algorithm which on input x 2 n and an integer m n outputs an integer k and y 2 m such that: y is k-dissimilar to x. There does not exist a string z of length m which is k ? 1 dissimilar to x.
متن کاملAn n log n Algorithm for Online BDD Refinement
Binary Decision Diagrams are in widespread use in verification systems for the canonical representation of Boolean functions. A BDD representing a function φ : B → N can easily be reduced to its canonical form in linear time. In this paper, we consider a natural online BDD refinement problem and show that it can be solved in O(n logn) if n bounds the size of the BDD and the total size of update...
متن کاملAn O ( n log n ) Algorithm for nding Dissimilar
Let be a nite alphabet and x 2 n. A string y 2 m is said to be k-dissimilar to x, if no k length substring of x is equal to any k length substring of y. We present an O(n log n) algorithm which on input x 2 n and an integer m n outputs an integer k and y 2 m such that: { y is k-dissimilar to x. { There does not exist a string z of length m which is k ? 1 dissimilar to x.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 1984
ISSN: 0022-0000
DOI: 10.1016/0022-0000(84)90011-4